#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
typedef pair<LL,LL>P;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
map<LL,LL>map1;
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      LL n;cin>>n;
      LL p=sqrt(n/2);
      if(n/2==p*p&&(n%2==0)){
         cout<<"YES"<<"\n";
         continue;
      }
      LL q=sqrt(n/4);
      if(q*q==n/4&&(n%4==0)){
          cout<<"YES"<<"\n";
          continue;
      }
      cout<<"NO"<<"\n";
   }
   return 0;
}
